A study on the possibility of implementing a real-time stereoscopic 3D rendering TV system

3D video has recently seen a massive increase in exposure in our lives. However, differences between the viewing and shooting conditions for a film lead to disparities between the reformed media and the original three-dimensional effect, which cause severe visual fatigue to viewers and result in headaches and dizziness. In this paper, a series of image processing algorithms are introduced to overcome these problems. The image processing pipeline is composed of four steps, eye-pupil detection, stereo correspondence computation, saliency map generation, and 3D warping. Each step is implemented in an S3DS-3D rendering system and its time complexity is measured. From the results, it was found that real-time stereoscopic 3D rendering is impossible using only a software implementation because SIFT and optical flow calculation requires a significant amount of time. Therefore, these two algorithm blocks should be implemented with hardware acceleration. Fortunately, active research is being conducted on these issues and real-time processing is expected to become available soon for applications beyond full-HD TV screens. In addition, it was found that saliency map generation and 3D warping blocks also need to be implemented in hardware for full-HD display although they do not have significant time complexity compared to SIFT and optical flow algorithm blocks.     

Non-chaotic and chaotic propagation of stationary and dynamic images through MVKS turbulence

Anisoplanatic electromagnetic (EM) propagation across a turbulent atmosphere has been recently examined for an unmodulated carrier propagating over an image-bearing transparency through optical lensing, and for the embedded information inside a carrier recovered using heterodyning and digital demodulation. Carrier modulation yielded better recovery than simple lens-based imaging. A possible mitigation strategy is proposed whereby the image information is encrypted on an RF chaotic carrier, thereafter secondarily embedded onto an optical carrier. Results based on the modified von Karman (MVKS) and the Hufnagel-Valley (H-V) models showed that the signal/image recovery under turbulence is improved compared with non-chaotic propagation. The case of time-varying/dynamic images is also taken up; it is demonstrated via cross-correlation products that turbulence is mitigated by the use of chaotic carrier encryption. Overall, transmission via chaos offers mitigation against distortions due to turbulence along with the security feature inherent via the chaos keys which prevent signal recovery without key-matching.     

Discriminative graph convolution networks for hyperspectral image classification

Recently, the proposal of graph convolutional networks (GCN) has successfully implemented into hyperspectral image data representation and analysis. In spite of the great success, there are still several major challenges in hyperspectral image classification, including within-class diversity, and between-class similarity, which generally degenerate hyperspectral image classification performance. To address the problems, we propose a discriminative graph convolution networks (DGCN) for hyperspectral image classification. This method introduces the concepts of within-class scatter and between-class scatter, which respectively reflect the global geometric structure and discriminative information of the input space. The experimental results on the hyperspectral data sets show that the proposed method has good classification performance.     

基于混合远景和近景区域暗通道算法的图像去雾研究

为了提高图像去雾效果,提出混合远景和近景区域暗通道算法。首先建立远景和近景区域暗通道,为近景区域最小值通道和远景区域最小值通道之和,不同区域设置不同的调节系数;接着估计大气光值,通过混合暗通道远景区域的前50个像素点颜色值的平均值获得,增设校正系数;然后导向滤波,采用自适应滑动窗口优化透射率;最后给出了算法流程。实验仿真显示所提算法去雾图像视觉效果较好,定量分析指标对比度、可见边对比度值较优。     

Heterogeneous Memristive Models Design and Its Application in Information Security

Based on the three-dimensional classic Chua circuit, a nonlinear circuit containing two flux-control memristors is designed. Due to the difference in the design of the characteristic equation of the two magnetron memristors, their position form a symmetrical structure with respect to the capacitor. The existence of chaotic properties is proved by analyzing the stability of the system, including Lyapunov exponent, equilibrium point, eigenvalue, Poincare map, power spectrum, bifurcation diagram et al. Theoretical analysis and numerical calculation show that this heterogeneous memristive model is a hyperchaotic five-dimensional nonlinear dynamical system and has a strong chaotic behavior. Then, the memristive system is applied to digital image and speech signal processing. The analysis of the key space, sensitivity of key parameters, and statistical character of encrypted scheme imply that this model can applied widely in multimedia information security.     

基于文本与语义相关性分析的图像检索

为了更加有效地检索到符合用户复杂语义需求的图像，提出一种基于文本描述与语义相关性分析的图像检索算法。该方法将图像检索分为两步：基于文本语义相关性分析的图像检索和基于SIFT特征的相似图像扩展检索。根据自然语言处理技术分析得到用户文本需求中的关键词及其语义关联，在选定图像库中通过语义相关性分析得到“种子”图像；接下来在图像扩展检索中，采用基于SIFT特征的相似图像检索，利用之前得到的“种子”图像作为查询条件，在网络图像库中进行扩展检索，并在结果集上根据两次检索的图像相似度进行排序输出，最终得到更加丰富有效的图像检索结果。为了证明算法的有效性，在标准数据集Corel5K和网络数据集Deriantart8K上完成了多组实验，实验结果证明该方法能够得到较为精确地符合用户语义要求的图像检索结果，并且通过扩展算法可以得到更加丰富的检索结果。     

具有光照鲁棒的图像匹配方法

针对现有的基于局部特征的图像匹配算法对光照变化敏感、匹配正确率低等问题，提出一种具有光照鲁棒性的图像匹配算法。首先使用实时对比保留去色（RTCP）算法灰度化图像，然后利用对比拉伸函数模拟不同光照变换对图像的影响从而提取抗光照变换特征点，最后采用局部强度顺序模式建立特征点描述符，根据待匹配图像局部特征点描述符的欧氏距离判断是否为成对匹配点。在公开数据集上，所提算法与尺度不变特征变换（SIFT）算法、加速鲁棒特征（SURF）算法、"风"（KAZE）算法和ORB算法在匹配速度和匹配正确率上进行了对比实验。实验结果表明：随着图像亮度差异的增加，SIFT算法、SURF算法、"风"（KAZE）算法和ORB算法匹配正确率下降迅速，所提算法下降缓慢并且正确率均高于80%；所提算法特征点检测较慢和描述符维数较高，平均耗时为23.47 s，匹配速度不及另外四种算法，但匹配质量却远超过它们。对实时性要求不高的系统中，所提算法可以克服光照变化对图像匹配造成的影响。     

Road Extraction from High Resolution Remote Sensing Image based on Shape Analysis with Gestalt Theory

Simulating the psychological experience of human vision，a road extraction model based on the format tower is proposed to extract the road in the high resolution remote sensing image from the perspective of morphology.Firstly，based on the spectral and texture information，the suspected road targets are extracted by using segmentation technology.Then these targets are classified according to their reliability and extract the road targets for each category.Finally，three types of identified road information are verified and merged，and the continuous smooth road extraction results are obtained.Experiments on real high resolution images show that the results are consistent with the visual perception of the human eye，and the overall classification accuracy is higher，indicating that the algorithm is effective and feasible and has good use value.     

基于密集神经网络的灰度图像着色算法

针对在灰度图像着色领域中，传统算法信息提取率不高、着色效果不理想的问题，提出了基于密集神经网络的灰度图像着色算法，以实现改善着色效果，让人眼更好地观察图片信息的目的。利用密集神经网络的信息提取高效性，构建并训练了一个端到端的深度学习模型，对图像中的各类信息及特征进行提取。训练网络时与原图像进行对比，以逐渐减小网络输出结果的信息、分类等各类型的损失。训练完成后，只需向网络输入一张灰度图片，即可生成一张颜色饱满、鲜明逼真的彩色图片。实验结果表明，引入密集网络后，可有效改善着色过程中的漏色、细节信息损失、对比度低等问题，所提算法着色效果较基于VGG网络及U-Net、双流网络结构、残差网络（ResNet）等性能优异的先进着色算法而言取得了显著的改进。     

结合细粒度特征与深度卷积网络的手绘图检索

目的 传统的手绘图像检索方法主要集中在检索相同类别的图像，忽略了手绘图像的细粒度特征。对此，提出了一种新的结合细粒度特征与深度卷积网络的手绘图像检索方法，既注重通过深度跨域实现整体匹配，也实现细粒度细节匹配。方法 首先构建多通道混合卷积神经网络，对手绘图像和自然图像分别进行不同的处理；其次通过在网络中加入注意力模型来获取细粒度特征；最后将粗细特征融合，进行相似性度量，得到检索结果。结果 在不同的数据库上进行实验，与传统的尺度不变特征（SIFT）、方向梯度直方图（HOG）和深度手绘模型Deep SaN（sketch-a-net）、Deep 3DS（sketch）、Deep TSN（triplet sketch net）等5种基准方法进行比较，选取了Top-1和Top-10，在鞋子数据集上，本文方法Top-1正确率提升了12%，在椅子数据集上，本文方法Top-1正确率提升了11%，Top-10提升了3%，与传统的手绘检索方法相比，本文方法得到了更高的准确率。在实验中，本文方法通过手绘图像能在第1幅检索出绝大多数的目标图像，达到了实例级别手绘检索的目的。结论 提出了一种新的手绘图像检索方法，为手绘图像和自然图像的跨域检索提供了一种新思路，进行实例级别的手绘检索，与原有的方法相比，检索精度得到明显提升，证明了本文方法的可行性。